Combinatorial sieves of dimension exceeding one

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sieves of Dimension 1 +

with fκ(s) as large as possible (resp. Fκ(s) as small as possible) given that the above inequality holds for all choices of A satisfying (1). Selberg [2] has shown (in a much more general context) that the functions fκ(s), Fκ(s) are continuous, monotone, and computable for s > 1, that they do not change if we replace (1) with (2), and that they tend to 1 exponentially as s goes to infinity. Mor...

متن کامل

Entropy, dimension and combinatorial moduli for one-dimensional dynamical systems

The goal of this thesis is to provide a unified framework in which to analyze the dynamics of two seemingly unrelated families of one-dimensional dynamical systems, namely the family of quadratic polynomials and continued fractions. We develop a combinatorial calculus to describe the bifurcation set of both families and prove they are isomorphic. As a corollary, we establish a series of results...

متن کامل

Simulations of transport in one dimension

Advection-dispersion equation is solved in numerically by using combinations of differential quadrature method (DQM) and various time integration techniques covering some explicit or implicit single and multi step methods. Two different initial boundary value problems modeling conservative and nonconservative transports of some substance represented by initial data are chosen as test problems. ...

متن کامل

Entropy and the Combinatorial Dimension

We solve Talagrand’s entropy problem: the L2-covering numbers of every uniformly bounded class of functions are subexponential in the combinatorial dimension of the class.

متن کامل

Combinatorial Dimension Theory of Algebraic Varieties

How can one compute the dimension of a projective algebraic subset, given by a system of equations? There are different definitions, and their equivalence is part of the classical dimension theory in algebraic geometry. The game is then the following: to make some definition of dimension effective enough to get an algorithm. A first method consists to think algebraically and to use the Hilbert ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 1988

ISSN: 0022-314X

DOI: 10.1016/0022-314x(88)90046-7